Preprocessing to Reduce Vehicle Capacity for Routing Problems
نویسندگان
چکیده
Abstract We provide a preprocessing method to reduce the vehicle capacity for instances of capacitated routing problem. This improves LP bound many formulations It also speeds up common algorithms which computation time depends on capacity. Our simulation experiments suggest that, perhaps surprisingly, often is very tight in sense that it cannot be reduced by much.
منابع مشابه
Online vehicle routing problems
The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years; two entire monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard, polynomial-time approximation algorithms are usually studied. However, usually the approaches to the...
متن کاملSTOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES
The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملComputational Approaches to Stochastic Vehicle Routing Problems
We develop and test several heuristics for two well-known vehicle routing problems which have stochastic demand: the probabilistic traveling salesman problem (PTSP) and the probabilistic vehicle routing problem (PVRP). The goal in these problems is to obtain optimal a priori tours, that is, tours which are designed before demands are known. We develop a number of heuristics which lead to such s...
متن کاملLearning Hybrid Algorithms for Vehicle Routing Problems
This paper presents a generic technique for improving hybrid algorithms through the discovery of and tuning of meta-heuristics. The idea is to represent a family of “push/pull” heuristics that are based upon inserting and removing tasks in a current solution, with an algebra. We then let a learning algorithm search for the best possible algebraic term, which represents a hybrid algorithm for a ...
متن کاملParallel algorithms for vehicle routing problems
In a complete directed weighted graph there are jobs located at nodes of the graph. Job i has an associated processing time or handling time hi, and the job must start within a prespecified time window [ri; di]. A vehicle can move on the arcs of the graph, at unit speed, and that has to execute the jobs within their respective time windows. We consider three different problems on the CREW PRAM....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Forum
سال: 2023
ISSN: ['2662-2556']
DOI: https://doi.org/10.1007/s43069-023-00220-9